An effective and efficient evolutionary algorithm for many-objective optimization

نویسندگان

چکیده

In evolutionary multiobjective optimization, effectiveness refers to how an algorithm performs in terms of converging its solutions into the Pareto front and also diversifying them over front. This is not easy job, particularly for optimization problems with more than three objectives, dubbed many-objective problems. such problems, classic Pareto-based algorithms fail provide sufficient selection pressure towards front, whilst recently developed algorithms, as decomposition-based ones, may struggle maintain a set well-distributed on certain (e.g., those irregular fronts). Another issue some optimizers rapidly increasing computational requirement number hypervolume-based shift-based density estimation (SDE) methods. this paper, we aim address problem develop effective efficient (E3A) that can handle various E3A, inspired by SDE, novel population maintenance method proposed select high-quality environmental procedure. We conduct extensive experiments show E3A better 11 state-of-the-art quickly finding well-converged well-diversified solutions.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

IGD Indicator-based Evolutionary Algorithm for Many-objective Optimization Problems

Inverted Generational Distance (IGD) has been widely considered as a reliable performance indicator to concurrently quantify the convergence and diversity of multiand manyobjective evolutionary algorithms. In this paper, an IGD indicatorbased evolutionary algorithm for solving many-objective optimization problems (MaOPs) has been proposed. Specifically, the IGD indicator is employed in each gen...

متن کامل

Evolutionary Many-Objective Optimization Based on Kuhn-Munkres' Algorithm

In this paper, we propose a new multi-objective evolutionary algorithm (MOEA), which transforms a multi-objective optimization problem into a linear assignment problem using a set of weight vectors uniformly scattered. Our approach adopts uniform design to obtain the set of weights and Kuhn-Munkres’ (Hungarian) algorithm to solve the assignment problem. Differential evolution is used as our sea...

متن کامل

Efficient Evolutionary Algorithm for Single-Objective Bilevel Optimization

Bilevel optimization problems are a class of challenging optimization problems, which contain two levels of optimization tasks. In these problems, the optimal solutions to the lower level problem become possible feasible candidates to the upper level problem. Such a requirement makes the optimization problem difficult to solve, and has kept the researchers busy towards devising methodologies, w...

متن کامل

HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization

In the field of evolutionary multi-criterion optimization, the hypervolume indicator is the only single set quality measure that is known to be strictly monotonic with regard to Pareto dominance: whenever a Pareto set approximation entirely dominates another one, then the indicator value of the dominant set will also be better. This property is of high interest and relevance for problems involv...

متن کامل

Effective ranking + speciation = Many-objective optimization

Multiobjective optimization problems have been widely addressed using evolutionary computation techniques. However, when dealing with more than three conflicting objectives (the so-called many-objective problems), the performance of such approaches deteriorates. The problem lies in the inability of Pareto dominance to provide an effective discrimination. Alternative ranking methods have been su...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information Sciences

سال: 2022

ISSN: ['0020-0255', '1872-6291']

DOI: https://doi.org/10.1016/j.ins.2022.10.077